Base | Representation |
---|---|
bin | 1001001000011101101101… |
… | …1100000111101010000111 |
3 | 1022112220121221212220102010 |
4 | 2102013123130013222013 |
5 | 2304003002124334310 |
6 | 33204440405145303 |
7 | 2054303561031435 |
oct | 222073334075207 |
9 | 38486557786363 |
10 | 10041020152455 |
11 | 322141111a766 |
12 | 11620253bb233 |
13 | 57ab30682896 |
14 | 269db8db1d55 |
15 | 1262cb28c320 |
hex | 921db707a87 |
10041020152455 has 64 divisors (see below), whose sum is σ = 17054779392000. Its totient is φ = 5033634663552.
The previous prime is 10041020152447. The next prime is 10041020152459. The reversal of 10041020152455 is 55425102014001.
10041020152455 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 10041020152455 - 23 = 10041020152447 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10041020152459) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 54031186 + ... + 54216704.
It is an arithmetic number, because the mean of its divisors is an integer number (266480928000).
Almost surely, 210041020152455 is an apocalyptic number.
10041020152455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10041020152455 is a deficient number, since it is larger than the sum of its proper divisors (7013759239545).
10041020152455 is a wasteful number, since it uses less digits than its factorization.
10041020152455 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188268.
The product of its (nonzero) digits is 8000, while the sum is 30.
Adding to 10041020152455 its reverse (55425102014001), we get a palindrome (65466122166456).
The spelling of 10041020152455 in words is "ten trillion, forty-one billion, twenty million, one hundred fifty-two thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •