Base | Representation |
---|---|
bin | 11011010000101101… |
… | …10000011100011110 |
3 | 1101202222122111020001 |
4 | 31220112300130132 |
5 | 214433214313300 |
6 | 10420141444514 |
7 | 1025454244216 |
oct | 155026603436 |
9 | 41688574201 |
10 | 14635697950 |
11 | 6230519545 |
12 | 2a0557073a |
13 | 14c3226103 |
14 | 9cbab3246 |
15 | 5a9d5316a |
hex | 3685b071e |
14635697950 has 24 divisors (see below), whose sum is σ = 27265598640. Its totient is φ = 5844988800.
The previous prime is 14635697933. The next prime is 14635697969. The reversal of 14635697950 is 5979653641.
14635697950 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (55) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 14635697891 and 14635697900.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 200395 + ... + 263494.
It is an arithmetic number, because the mean of its divisors is an integer number (1136066610).
Almost surely, 214635697950 is an apocalyptic number.
14635697950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14635697950 is a deficient number, since it is larger than the sum of its proper divisors (12629900690).
14635697950 is a wasteful number, since it uses less digits than its factorization.
14635697950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464532 (or 464527 counting only the distinct ones).
The product of its (nonzero) digits is 6123600, while the sum is 55.
The spelling of 14635697950 in words is "fourteen billion, six hundred thirty-five million, six hundred ninety-seven thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •