Base | Representation |
---|---|
bin | 1001001101110001001000… |
… | …0001000111010010001010 |
3 | 1022212121210120101110202211 |
4 | 2103130102001013102022 |
5 | 2312001100303230010 |
6 | 33314345240215334 |
7 | 2064010426060315 |
oct | 223342201072212 |
9 | 38777716343684 |
10 | 10132130133130 |
11 | 3257015352755 |
12 | 1177811a6a54a |
13 | 5865c043b655 |
14 | 27057d48997c |
15 | 12885ecc208a |
hex | 9371204748a |
10132130133130 has 32 divisors (see below), whose sum is σ = 19501842586320. Its totient is φ = 3776682163200.
The previous prime is 10132130133053. The next prime is 10132130133131. The reversal of 10132130133130 is 3133103123101.
It can be written as a sum of positive squares in 8 ways, for example, as 8599503465081 + 1532626668049 = 2932491^2 + 1237993^2 .
It is a super-2 number, since 2×101321301331302 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10132130133131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 295036125 + ... + 295070464.
Almost surely, 210132130133130 is an apocalyptic number.
10132130133130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10132130133130 is a deficient number, since it is larger than the sum of its proper divisors (9369712453190).
10132130133130 is a wasteful number, since it uses less digits than its factorization.
10132130133130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590106714.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 10132130133130 its reverse (3133103123101), we get a palindrome (13265233256231).
The spelling of 10132130133130 in words is "ten trillion, one hundred thirty-two billion, one hundred thirty million, one hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •