Base | Representation |
---|---|
bin | 10011001101101010… |
… | …11100100000110101 |
3 | 222121212220112002220 |
4 | 21212311130200311 |
5 | 132111144033140 |
6 | 4423322552553 |
7 | 513422634513 |
oct | 114665344065 |
9 | 28555815086 |
10 | 10315221045 |
11 | 4413745278 |
12 | 1bba668759 |
13 | c850b73bc |
14 | 6dbd794b3 |
15 | 4058c6bd0 |
hex | 266d5c835 |
10315221045 has 64 divisors (see below), whose sum is σ = 17130839040. Its totient is φ = 5297707008.
The previous prime is 10315221029. The next prime is 10315221047. The reversal of 10315221045 is 54012251301.
It is a happy number.
10315221045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10315221045 - 24 = 10315221029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10315221047) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 9184854 + ... + 9185976.
It is an arithmetic number, because the mean of its divisors is an integer number (267669360).
Almost surely, 210315221045 is an apocalyptic number.
10315221045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10315221045 is a deficient number, since it is larger than the sum of its proper divisors (6815617995).
10315221045 is a wasteful number, since it uses less digits than its factorization.
10315221045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1394.
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 10315221045 its reverse (54012251301), we get a palindrome (64327472346).
The spelling of 10315221045 in words is "ten billion, three hundred fifteen million, two hundred twenty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •