Base | Representation |
---|---|
bin | 1001001100101010100111… |
… | …0001000000111001001000 |
3 | 1022210210221101021200212220 |
4 | 2103022221301000321020 |
5 | 2311143314002304000 |
6 | 33301535051534040 |
7 | 2062440360646254 |
oct | 223125161007110 |
9 | 38723841250786 |
10 | 10113201213000 |
11 | 3249a91485906 |
12 | 117400a75a320 |
13 | 58489492a0b2 |
14 | 26d6a5535264 |
15 | 1281030c81a0 |
hex | 932a9c40e48 |
10113201213000 has 128 divisors (see below), whose sum is σ = 33409257822720. Its totient is φ = 2538215193600.
The previous prime is 10113201212977. The next prime is 10113201213043. The reversal of 10113201213000 is 31210231101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 99098032 + ... + 99200031.
It is an arithmetic number, because the mean of its divisors is an integer number (261009826740).
Almost surely, 210113201213000 is an apocalyptic number.
10113201213000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10113201213000 is an abundant number, since it is smaller than the sum of its proper divisors (23296056609720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113201213000 is a wasteful number, since it uses less digits than its factorization.
10113201213000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198298104 (or 198298090 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10113201213000 its reverse (31210231101), we get a palindrome (10144411444101).
The spelling of 10113201213000 in words is "ten trillion, one hundred thirteen billion, two hundred one million, two hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •