Base | Representation |
---|---|
bin | 10111000010010000011110… |
… | …100011001101000010111000 |
3 | 111021201011100002212201112020 |
4 | 113002100132203031002320 |
5 | 101234331242441414000 |
6 | 555245132555514440 |
7 | 30224264141011212 |
oct | 2702203643150270 |
9 | 437634302781466 |
10 | 101310201123000 |
11 | 2a30a462423031 |
12 | b442719458a20 |
13 | 446b6847b902c |
14 | 1b036231155b2 |
15 | baa49e07eba0 |
hex | 5c241e8cd0b8 |
101310201123000 has 64 divisors (see below), whose sum is σ = 316087827513120. Its totient is φ = 27016053632000.
The previous prime is 101310201122987. The next prime is 101310201123011. The reversal of 101310201123000 is 321102013101.
It is a happy number.
It is a super-2 number, since 2×1013102011230002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16885030521 + ... + 16885036520.
Almost surely, 2101310201123000 is an apocalyptic number.
101310201123000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101310201123000 is an abundant number, since it is smaller than the sum of its proper divisors (214777626390120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101310201123000 is a wasteful number, since it uses less digits than its factorization.
101310201123000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33770067065 (or 33770067051 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101310201123000 its reverse (321102013101), we get a palindrome (101631303136101).
The spelling of 101310201123000 in words is "one hundred one trillion, three hundred ten billion, two hundred one million, one hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •