Base | Representation |
---|---|
bin | 10011101010100010110… |
… | …000000111010111001001 |
3 | 11210012001220220120202102 |
4 | 103222202300013113021 |
5 | 134120031131044001 |
6 | 2512445101443145 |
7 | 166426501424660 |
oct | 23524260072711 |
9 | 4705056816672 |
10 | 1351350253001 |
11 | 481116a96311 |
12 | 199a985704b5 |
13 | 9a57c818728 |
14 | 4959735bdd7 |
15 | 252420d4e6b |
hex | 13aa2c075c9 |
1351350253001 has 16 divisors (see below), whose sum is σ = 1642089438720. Its totient is φ = 1085603527680.
The previous prime is 1351350252997. The next prime is 1351350253031. The reversal of 1351350253001 is 1003520531531.
It is a happy number.
It is not a de Polignac number, because 1351350253001 - 22 = 1351350252997 is a prime.
It is a super-2 number, since 2×13513502530012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1351350253031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23728640 + ... + 23785521.
It is an arithmetic number, because the mean of its divisors is an integer number (102630589920).
Almost surely, 21351350253001 is an apocalyptic number.
It is an amenable number.
1351350253001 is a deficient number, since it is larger than the sum of its proper divisors (290739185719).
1351350253001 is a wasteful number, since it uses less digits than its factorization.
1351350253001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47514424.
The product of its (nonzero) digits is 6750, while the sum is 29.
Adding to 1351350253001 its reverse (1003520531531), we get a palindrome (2354870784532).
The spelling of 1351350253001 in words is "one trillion, three hundred fifty-one billion, three hundred fifty million, two hundred fifty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •