Base | Representation |
---|---|
bin | 1101000001010111000111… |
… | …1010011110011011110110 |
3 | 1212200200202221020222100220 |
4 | 3100111301322132123312 |
5 | 3334032243002330430 |
6 | 50241053413315210 |
7 | 3005241345601116 |
oct | 320256172363366 |
9 | 55620687228326 |
10 | 14317037151990 |
11 | 461a904256391 |
12 | 17328a2935b06 |
13 | 7cb124683381 |
14 | 376d3c1a1046 |
15 | 19c644172110 |
hex | d0571e9e6f6 |
14317037151990 has 16 divisors (see below), whose sum is σ = 34360889164848. Its totient is φ = 3817876573856.
The previous prime is 14317037151971. The next prime is 14317037152007. The reversal of 14317037151990 is 9915173071341.
It is a super-2 number, since 2×143170371519902 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 238617285837 + ... + 238617285896.
It is an arithmetic number, because the mean of its divisors is an integer number (2147555572803).
Almost surely, 214317037151990 is an apocalyptic number.
14317037151990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14317037151990 is an abundant number, since it is smaller than the sum of its proper divisors (20043852012858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14317037151990 is a wasteful number, since it uses less digits than its factorization.
14317037151990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477234571743.
The product of its (nonzero) digits is 714420, while the sum is 51.
The spelling of 14317037151990 in words is "fourteen trillion, three hundred seventeen billion, thirty-seven million, one hundred fifty-one thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •