Base | Representation |
---|---|
bin | 11101100110101101001011… |
… | …100010111101000010000010 |
3 | 122002000022012221121021002220 |
4 | 131212231023202331002002 |
5 | 114031222123431013242 |
6 | 1140530305205151510 |
7 | 36265604462035305 |
oct | 3546551342750202 |
9 | 562008187537086 |
10 | 130203201032322 |
11 | 3853995a657390 |
12 | 1272a3046bb596 |
13 | 5786155b14a12 |
14 | 2421c23456b3c |
15 | 100bd3da71bec |
hex | 766b4b8bd082 |
130203201032322 has 64 divisors (see below), whose sum is σ = 291761238432384. Its totient is φ = 38388663728640.
The previous prime is 130203201032309. The next prime is 130203201032329. The reversal of 130203201032322 is 223230102302031.
It is a junction number, because it is equal to n+sod(n) for n = 130203201032292 and 130203201032301.
It is not an unprimeable number, because it can be changed into a prime (130203201032329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 222508558 + ... + 223092950.
It is an arithmetic number, because the mean of its divisors is an integer number (4558769350506).
Almost surely, 2130203201032322 is an apocalyptic number.
130203201032322 is an abundant number, since it is smaller than the sum of its proper divisors (161558037400062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130203201032322 is a wasteful number, since it uses less digits than its factorization.
130203201032322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675683.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 130203201032322 its reverse (223230102302031), we get a palindrome (353433303334353).
The spelling of 130203201032322 in words is "one hundred thirty trillion, two hundred three billion, two hundred one million, thirty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •