Base | Representation |
---|---|
bin | 11111111011011011000111… |
… | …101001000110000100111000 |
3 | 200102012022100000120220102120 |
4 | 133323123013221012010320 |
5 | 121401142311103323300 |
6 | 1214353235040001240 |
7 | 41402141045550510 |
oct | 3773330751060470 |
9 | 612168300526376 |
10 | 140423010214200 |
11 | 4081a07849a09a |
12 | 138bab06000220 |
13 | 6047aaa2760ac |
14 | 269671d47a840 |
15 | 1137ad10613a0 |
hex | 7fb6c7a46138 |
140423010214200 has 192 divisors, whose sum is σ = 497509452000000. Its totient is φ = 32095992099840.
The previous prime is 140423010214183. The next prime is 140423010214237. The reversal of 140423010214200 is 2412010324041.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 207558076 + ... + 208233524.
It is an arithmetic number, because the mean of its divisors is an integer number (2591195062500).
Almost surely, 2140423010214200 is an apocalyptic number.
140423010214200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140423010214200 is an abundant number, since it is smaller than the sum of its proper divisors (357086441785800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140423010214200 is a wasteful number, since it uses less digits than its factorization.
140423010214200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 724974 (or 724965 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 140423010214200 its reverse (2412010324041), we get a palindrome (142835020538241).
The spelling of 140423010214200 in words is "one hundred forty trillion, four hundred twenty-three billion, ten million, two hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •