Base | Representation |
---|---|
bin | 10111000010011100011111… |
… | …100101001001110001101000 |
3 | 111021202101122021121212220010 |
4 | 113002130133211021301220 |
5 | 101240034203422004000 |
6 | 555255105134331520 |
7 | 30225231645554412 |
oct | 2702343745116150 |
9 | 437671567555803 |
10 | 101323103313000 |
11 | 2a314983372378 |
12 | b44511a359ba0 |
13 | 446c95c832c9a |
14 | 1b040c889d9b2 |
15 | baa9a6b10d50 |
hex | 5c271f949c68 |
101323103313000 has 64 divisors (see below), whose sum is σ = 316128082345920. Its totient is φ = 27019494216000.
The previous prime is 101323103312993. The next prime is 101323103313053. The reversal of 101323103313000 is 313301323101.
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 15 ways as a sum of consecutive naturals, for example, 16887180886 + ... + 16887186885.
It is an arithmetic number, because the mean of its divisors is an integer number (4939501286655).
Almost surely, 2101323103313000 is an apocalyptic number.
101323103313000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101323103313000 is an abundant number, since it is smaller than the sum of its proper divisors (214804979032920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101323103313000 is a wasteful number, since it uses less digits than its factorization.
101323103313000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33774367795 (or 33774367781 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 101323103313000 its reverse (313301323101), we get a palindrome (101636404636101).
The spelling of 101323103313000 in words is "one hundred one trillion, three hundred twenty-three billion, one hundred three million, three hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •