Base | Representation |
---|---|
bin | 1001011101011011001111… |
… | …0001111101000011101111 |
3 | 1100211100010202221020100120 |
4 | 2113112303301331003233 |
5 | 2330403004300243211 |
6 | 34042114124500023 |
7 | 2122312514415606 |
oct | 227266361750357 |
9 | 40740122836316 |
10 | 10401132040431 |
11 | 3350105975120 |
12 | 11bb9860aa613 |
13 | 5a5a90185172 |
14 | 27d5bb7b0a3d |
15 | 130855e00d06 |
hex | 975b3c7d0ef |
10401132040431 has 32 divisors (see below), whose sum is σ = 15755152250880. Its totient is φ = 6046385049600.
The previous prime is 10401132040367. The next prime is 10401132040469. The reversal of 10401132040431 is 13404023110401.
It is not a de Polignac number, because 10401132040431 - 26 = 10401132040367 is a prime.
It is a super-2 number, since 2×104011320404312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10401132040471) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44872386 + ... + 45103583.
It is an arithmetic number, because the mean of its divisors is an integer number (492348507840).
Almost surely, 210401132040431 is an apocalyptic number.
10401132040431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10401132040431 is a deficient number, since it is larger than the sum of its proper divisors (5354020210449).
10401132040431 is a wasteful number, since it uses less digits than its factorization.
10401132040431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89976127.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 10401132040431 its reverse (13404023110401), we get a palindrome (23805155150832).
The spelling of 10401132040431 in words is "ten trillion, four hundred one billion, one hundred thirty-two million, forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •