Base | Representation |
---|---|
bin | 11010110010111010… |
… | …00100111110110010 |
3 | 1101010120020002222010 |
4 | 31121131010332302 |
5 | 213430214243230 |
6 | 10335251223350 |
7 | 1016330255451 |
oct | 153135047662 |
9 | 41116202863 |
10 | 14385696690 |
11 | 6112394932 |
12 | 29558a7b56 |
13 | 14834b2c81 |
14 | 9a67d6b98 |
15 | 592e1d9b0 |
hex | 359744fb2 |
14385696690 has 32 divisors (see below), whose sum is σ = 34529146560. Its totient is φ = 3835799744.
The previous prime is 14385696643. The next prime is 14385696707. The reversal of 14385696690 is 9669658341.
It is a super-2 number, since 2×143856966902 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14385696690.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 402781 + ... + 437039.
It is an arithmetic number, because the mean of its divisors is an integer number (1079035830).
Almost surely, 214385696690 is an apocalyptic number.
14385696690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14385696690 is an abundant number, since it is smaller than the sum of its proper divisors (20143449870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14385696690 is a wasteful number, since it uses less digits than its factorization.
14385696690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48266.
The product of its (nonzero) digits is 8398080, while the sum is 57.
The spelling of 14385696690 in words is "fourteen billion, three hundred eighty-five million, six hundred ninety-six thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •