Base | Representation |
---|---|
bin | 100010001111111001110111… |
… | …1001111110111001011000100 |
3 | 1110111122111200221020112000010 |
4 | 1010133303233033313023010 |
5 | 303441212141113213322 |
6 | 2544413421000350220 |
7 | 120311545446264462 |
oct | 10437635717671304 |
9 | 1414574627215003 |
10 | 301253020054212 |
11 | 87a96763197036 |
12 | 29954a2aa75370 |
13 | cc13065345a65 |
14 | 5456a1c7d7832 |
15 | 24c64380e520c |
hex | 111fcef3f72c4 |
301253020054212 has 24 divisors (see below), whose sum is σ = 704109082301856. Its totient is φ = 100248334945408.
The previous prime is 301253020054187. The next prime is 301253020054219. The reversal of 301253020054212 is 212450020352103.
It is a self number, because there is not a number n which added to its sum of digits gives 301253020054212.
It is not an unprimeable number, because it can be changed into a prime (301253020054219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21167293338 + ... + 21167307569.
It is an arithmetic number, because the mean of its divisors is an integer number (29337878429244).
Almost surely, 2301253020054212 is an apocalyptic number.
It is an amenable number.
301253020054212 is an abundant number, since it is smaller than the sum of its proper divisors (402856062247644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301253020054212 is a wasteful number, since it uses less digits than its factorization.
301253020054212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42334601507 (or 42334601505 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The spelling of 301253020054212 in words is "three hundred one trillion, two hundred fifty-three billion, twenty million, fifty-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •