Base | Representation |
---|---|
bin | 1001101010101111110100… |
… | …0101001000110010111100 |
3 | 1101122012212122002212201010 |
4 | 2122223331011020302330 |
5 | 2343130212214311300 |
6 | 34335204033515220 |
7 | 2144664121200003 |
oct | 232537505106274 |
9 | 41565778085633 |
10 | 10629995072700 |
11 | 34291791056a3 |
12 | 12381b7a12b10 |
13 | 5c1534144153 |
14 | 28a6cccd7c3a |
15 | 13679d264a50 |
hex | 9aafd148cbc |
10629995072700 has 72 divisors (see below), whose sum is σ = 30756651167088. Its totient is φ = 2834616312320.
The previous prime is 10629995072687. The next prime is 10629995072747. The reversal of 10629995072700 is 727059992601.
It is a super-2 number, since 2×106299950727002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19109704 + ... + 19658096.
It is an arithmetic number, because the mean of its divisors is an integer number (427175710654).
Almost surely, 210629995072700 is an apocalyptic number.
10629995072700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10629995072700 is an abundant number, since it is smaller than the sum of its proper divisors (20126656094388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10629995072700 is a wasteful number, since it uses less digits than its factorization.
10629995072700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613023 (or 613016 counting only the distinct ones).
The product of its (nonzero) digits is 4286520, while the sum is 57.
The spelling of 10629995072700 in words is "ten trillion, six hundred twenty-nine billion, nine hundred ninety-five million, seventy-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •