Base | Representation |
---|---|
bin | 101001110000011… |
… | …0001101110111011 |
3 | 10121122102022120122 |
4 | 1103200301232323 |
5 | 10332140214433 |
6 | 351010243455 |
7 | 46502110163 |
oct | 12340615673 |
9 | 3548368518 |
10 | 1401101243 |
11 | 659981113 |
12 | 33128658b |
13 | 194375ab9 |
14 | d411b5a3 |
15 | 83011198 |
hex | 53831bbb |
1401101243 has 4 divisors (see below), whose sum is σ = 1401258768. Its totient is φ = 1400943720.
The previous prime is 1401101231. The next prime is 1401101267. The reversal of 1401101243 is 3421011041.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1401101243 - 24 = 1401101227 is a prime.
It is a super-2 number, since 2×14011012432 = 3926169386272290098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1401101543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64568 + ... + 83493.
It is an arithmetic number, because the mean of its divisors is an integer number (350314692).
Almost surely, 21401101243 is an apocalyptic number.
1401101243 is a deficient number, since it is larger than the sum of its proper divisors (157525).
1401101243 is an equidigital number, since it uses as much as digits as its factorization.
1401101243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157524.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1401101243 is about 37431.2869535633. The cubic root of 1401101243 is about 1118.9821862457.
Adding to 1401101243 its reverse (3421011041), we get a palindrome (4822112284).
The spelling of 1401101243 in words is "one billion, four hundred one million, one hundred one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •