Base | Representation |
---|---|
bin | 10111000010100011001000… |
… | …010111011011101011101010 |
3 | 111021210002000221210210000112 |
4 | 113002203020113123223222 |
5 | 101240143302342030010 |
6 | 555302244240534322 |
7 | 30225603363644210 |
oct | 2702431027335352 |
9 | 437702027723015 |
10 | 101330230033130 |
11 | 2a317a001a871a |
12 | b4465890213a2 |
13 | 4470527176847 |
14 | 1b045a31a4cb0 |
15 | baac7260ba05 |
hex | 5c28c85dbaea |
101330230033130 has 128 divisors (see below), whose sum is σ = 210677549322240. Its totient is φ = 34372583032320.
The previous prime is 101330230033093. The next prime is 101330230033139. The reversal of 101330230033130 is 31330032033101.
It is a junction number, because it is equal to n+sod(n) for n = 101330230033096 and 101330230033105.
It is not an unprimeable number, because it can be changed into a prime (101330230033139) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3693990515 + ... + 3694017945.
It is an arithmetic number, because the mean of its divisors is an integer number (1645918354080).
Almost surely, 2101330230033130 is an apocalyptic number.
101330230033130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101330230033130 is an abundant number, since it is smaller than the sum of its proper divisors (109347319289110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101330230033130 is a wasteful number, since it uses less digits than its factorization.
101330230033130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28884.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 101330230033130 its reverse (31330032033101), we get a palindrome (132660262066231).
The spelling of 101330230033130 in words is "one hundred one trillion, three hundred thirty billion, two hundred thirty million, thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •