Base | Representation |
---|---|
bin | 10111000001010000111110… |
… | …110101100100000110110110 |
3 | 111021110122100200100000001022 |
4 | 113001100332311210012312 |
5 | 101232222130433031410 |
6 | 555153535441101142 |
7 | 30216331501230116 |
oct | 2701207665440666 |
9 | 437418320300038 |
10 | 101242023330230 |
11 | 2a293556883252 |
12 | b4314709277b2 |
13 | 446510aa38713 |
14 | 1b001d6517046 |
15 | ba880d912455 |
hex | 5c143ed641b6 |
101242023330230 has 16 divisors (see below), whose sum is σ = 188114211091584. Its totient is φ = 39190460643840.
The previous prime is 101242023330101. The next prime is 101242023330263. The reversal of 101242023330230 is 32033320242101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 101242023330230.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 163293585707 + ... + 163293586326.
It is an arithmetic number, because the mean of its divisors is an integer number (11757138193224).
Almost surely, 2101242023330230 is an apocalyptic number.
101242023330230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101242023330230 is a deficient number, since it is larger than the sum of its proper divisors (86872187761354).
101242023330230 is a wasteful number, since it uses less digits than its factorization.
101242023330230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326587172071.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 101242023330230 its reverse (32033320242101), we get a palindrome (133275343572331).
The spelling of 101242023330230 in words is "one hundred one trillion, two hundred forty-two billion, twenty-three million, three hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •