Base | Representation |
---|---|
bin | 1001010011100100000101… |
… | …0001101001111000010100 |
3 | 1100020010211021021221001221 |
4 | 2110321001101221320110 |
5 | 2320114014023333400 |
6 | 33432214215300124 |
7 | 2104134146422114 |
oct | 224710121517024 |
9 | 40203737257057 |
10 | 10231707246100 |
11 | 329527400053a |
12 | 1192b8207a644 |
13 | 592acc455282 |
14 | 2753082a9044 |
15 | 12b23bd26c1a |
hex | 94e41469e14 |
10231707246100 has 18 divisors (see below), whose sum is σ = 22202804724254. Its totient is φ = 4092682898400.
The previous prime is 10231707246077. The next prime is 10231707246109. The reversal of 10231707246100 is 164270713201.
It can be written as a sum of positive squares in 3 ways, for example, as 1024342361604 + 9207364884496 = 1012098^2 + 3034364^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231707246109) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 51158536131 + ... + 51158536330.
Almost surely, 210231707246100 is an apocalyptic number.
10231707246100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10231707246100 is an abundant number, since it is smaller than the sum of its proper divisors (11971097478154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10231707246100 is a wasteful number, since it uses less digits than its factorization.
10231707246100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102317072475 (or 102317072468 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 34.
Adding to 10231707246100 its reverse (164270713201), we get a palindrome (10395977959301).
The spelling of 10231707246100 in words is "ten trillion, two hundred thirty-one billion, seven hundred seven million, two hundred forty-six thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •