Base | Representation |
---|---|
bin | 1101000001101010101110… |
… | …1010111110000011011100 |
3 | 1212201012100210100220211021 |
4 | 3100122223222332003130 |
5 | 3334124033042224040 |
6 | 50243324014533524 |
7 | 3005515654650436 |
oct | 320325352760334 |
9 | 55635323326737 |
10 | 14322301133020 |
11 | 4622065676231 |
12 | 17339118072a4 |
13 | 7cb78310b24a |
14 | 3772bb33b656 |
15 | 19c85137024a |
hex | d06ababe0dc |
14322301133020 has 24 divisors (see below), whose sum is σ = 30080504659968. Its totient is φ = 5728220971200.
The previous prime is 14322301133003. The next prime is 14322301133047. The reversal of 14322301133020 is 2033110322341.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 43549711 + ... + 43877350.
It is an arithmetic number, because the mean of its divisors is an integer number (1253354360832).
Almost surely, 214322301133020 is an apocalyptic number.
14322301133020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14322301133020 is an abundant number, since it is smaller than the sum of its proper divisors (15758203526948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14322301133020 is a wasteful number, since it uses less digits than its factorization.
14322301133020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87435261 (or 87435259 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 14322301133020 its reverse (2033110322341), we get a palindrome (16355411455361).
The spelling of 14322301133020 in words is "fourteen trillion, three hundred twenty-two billion, three hundred one million, one hundred thirty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •