Base | Representation |
---|---|
bin | 1011110101011001110111… |
… | …0010111000101101110000 |
3 | 1201001221111211222222022221 |
4 | 2331112131302320231300 |
5 | 3201142241421131000 |
6 | 43401402220210424 |
7 | 2512044023102215 |
oct | 275263562705560 |
9 | 51057454888287 |
10 | 13012103302000 |
11 | 41674470a8720 |
12 | 15619bb099a14 |
13 | 73506134b68a |
14 | 32db09653b0c |
15 | 17871c01061a |
hex | bd59dcb8b70 |
13012103302000 has 80 divisors (see below), whose sum is σ = 34323562731744. Its totient is φ = 4731673920000.
The previous prime is 13012103301973. The next prime is 13012103302001. The reversal of 13012103302000 is 20330121031.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012103302001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 295707621 + ... + 295751620.
Almost surely, 213012103302000 is an apocalyptic number.
13012103302000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13012103302000 is an abundant number, since it is smaller than the sum of its proper divisors (21311459429744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13012103302000 is a wasteful number, since it uses less digits than its factorization.
13012103302000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591459275 (or 591459259 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13012103302000 its reverse (20330121031), we get a palindrome (13032433423031).
The spelling of 13012103302000 in words is "thirteen trillion, twelve billion, one hundred three million, three hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •