Base | Representation |
---|---|
bin | 1001110110011110001011… |
… | …1100010010111110100000 |
3 | 1102100110210021122220020220 |
4 | 2131213202330102332200 |
5 | 2404430222010313100 |
6 | 35011515145203040 |
7 | 2165354454002223 |
oct | 235474274227640 |
9 | 42313707586226 |
10 | 10831420010400 |
11 | 34a6641248660 |
12 | 126b250790480 |
13 | 607524733812 |
14 | 29635a33d5ba |
15 | 13bb3b857aa0 |
hex | 9d9e2f12fa0 |
10831420010400 has 288 divisors, whose sum is σ = 40133624283648. Its totient is φ = 2511633484800.
The previous prime is 10831420010393. The next prime is 10831420010417. The reversal of 10831420010400 is 401002413801.
It is a super-2 number, since 2×108314200104002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 8311954 + ... + 9526353.
It is an arithmetic number, because the mean of its divisors is an integer number (139352862096).
Almost surely, 210831420010400 is an apocalyptic number.
10831420010400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10831420010400 is an abundant number, since it is smaller than the sum of its proper divisors (29302204273248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10831420010400 is a wasteful number, since it uses less digits than its factorization.
10831420010400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17838364 (or 17838351 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The spelling of 10831420010400 in words is "ten trillion, eight hundred thirty-one billion, four hundred twenty million, ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •