Base | Representation |
---|---|
bin | 10100011000111010000… |
… | …110111101110011011001 |
3 | 11221221120110021022102002 |
4 | 110120322012331303121 |
5 | 140424010331234113 |
6 | 2551401105250345 |
7 | 203141261363030 |
oct | 24307206756331 |
9 | 4857513238362 |
10 | 1401134243033 |
11 | 4a0243830928 |
12 | 1a76710339b5 |
13 | a21848b6bb5 |
14 | 4bb5b0dd717 |
15 | 266a7a0bc58 |
hex | 1463a1bdcd9 |
1401134243033 has 8 divisors (see below), whose sum is σ = 1601376386880. Its totient is φ = 1200912126480.
The previous prime is 1401134243009. The next prime is 1401134243053. The reversal of 1401134243033 is 3303424311041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1401134243033 - 212 = 1401134238937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1401134242987 and 1401134243005.
It is not an unprimeable number, because it can be changed into a prime (1401134243053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4856603 + ... + 5137008.
It is an arithmetic number, because the mean of its divisors is an integer number (200172048360).
Almost surely, 21401134243033 is an apocalyptic number.
It is an amenable number.
1401134243033 is a deficient number, since it is larger than the sum of its proper divisors (200242143847).
1401134243033 is an equidigital number, since it uses as much as digits as its factorization.
1401134243033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10013647.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1401134243033 its reverse (3303424311041), we get a palindrome (4704558554074).
The spelling of 1401134243033 in words is "one trillion, four hundred one billion, one hundred thirty-four million, two hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •