Base | Representation |
---|---|
bin | 1001010011100011001101… |
… | …1100101000111000000010 |
3 | 1100020010020002202000202210 |
4 | 2110320303130220320002 |
5 | 2320113030130311141 |
6 | 33432135210522550 |
7 | 2104125331431543 |
oct | 224706334507002 |
9 | 40203202660683 |
10 | 10231475244546 |
11 | 3295165050316 |
12 | 1192b18436456 |
13 | 592a93374c4a |
14 | 2752c55564ca |
15 | 12b22679a916 |
hex | 94e33728e02 |
10231475244546 has 32 divisors (see below), whose sum is σ = 20604438488448. Its totient is φ = 3386954869760.
The previous prime is 10231475244467. The next prime is 10231475244547. The reversal of 10231475244546 is 64544257413201.
It is a super-2 number, since 2×102314752445462 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10231475244495 and 10231475244504.
It is not an unprimeable number, because it can be changed into a prime (10231475244547) by changing a digit.
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, 4635615 + ... + 6477026.
It is an arithmetic number, because the mean of its divisors is an integer number (643888702764).
Almost surely, 210231475244546 is an apocalyptic number.
10231475244546 is an abundant number, since it is smaller than the sum of its proper divisors (10372963243902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10231475244546 is a wasteful number, since it uses less digits than its factorization.
10231475244546 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11113706.
The product of its (nonzero) digits is 3225600, while the sum is 48.
The spelling of 10231475244546 in words is "ten trillion, two hundred thirty-one billion, four hundred seventy-five million, two hundred forty-four thousand, five hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •