Base | Representation |
---|---|
bin | 10100011001001011110… |
… | …011011000111001011111 |
3 | 11221222100010212021000110 |
4 | 110121023303120321133 |
5 | 140430112330213043 |
6 | 2551450352101103 |
7 | 203151524545152 |
oct | 24311363307137 |
9 | 4858303767013 |
10 | 1401431101023 |
11 | 4a0386359708 |
12 | 1a7734534793 |
13 | a2201254805 |
14 | 4bb886d5c99 |
15 | 266c3ae9b33 |
hex | 1464bcd8e5f |
1401431101023 has 8 divisors (see below), whose sum is σ = 1949817184128. Its totient is φ = 893666209304.
The previous prime is 1401431101003. The next prime is 1401431101061. The reversal of 1401431101023 is 3201011341041.
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 1401431101023 - 224 = 1401414323807 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401431101003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10155297765 + ... + 10155297902.
It is an arithmetic number, because the mean of its divisors is an integer number (243727148016).
Almost surely, 21401431101023 is an apocalyptic number.
1401431101023 is a deficient number, since it is larger than the sum of its proper divisors (548386083105).
1401431101023 is a wasteful number, since it uses less digits than its factorization.
1401431101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20310595693.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1401431101023 its reverse (3201011341041), we get a palindrome (4602442442064).
The spelling of 1401431101023 in words is "one trillion, four hundred one billion, four hundred thirty-one million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •