Base | Representation |
---|---|
bin | 100010000111110000011010… |
… | …1010111100000111101010000 |
3 | 1110100200110021110001210100110 |
4 | 1010033200311113200331100 |
5 | 303314340303230014412 |
6 | 2542155143200521320 |
7 | 120134623510010436 |
oct | 10417406527407520 |
9 | 1410613243053313 |
10 | 300133210001232 |
11 | 876a4863653033 |
12 | 297b39b0920240 |
13 | cb6159533a45a |
14 | 541874c370d56 |
15 | 24a72483e8d3c |
hex | 110f8355e0f50 |
300133210001232 has 80 divisors (see below), whose sum is σ = 796350619673280. Its totient is φ = 97346764569600.
The previous prime is 300133210001231. The next prime is 300133210001329. The reversal of 300133210001232 is 232100012331003.
It is a junction number, because it is equal to n+sod(n) for n = 300133210001199 and 300133210001208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300133210001231) 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, 200450319 + ... + 201942062.
It is an arithmetic number, because the mean of its divisors is an integer number (9954382745916).
Almost surely, 2300133210001232 is an apocalyptic number.
It is an amenable number.
300133210001232 is an abundant number, since it is smaller than the sum of its proper divisors (496217409672048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300133210001232 is a wasteful number, since it uses less digits than its factorization.
300133210001232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 402392812 (or 402392806 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 300133210001232 its reverse (232100012331003), we get a palindrome (532233222332235).
The spelling of 300133210001232 in words is "three hundred trillion, one hundred thirty-three billion, two hundred ten million, one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •