Base | Representation |
---|---|
bin | 101110101011000110… |
… | …1000011110110110101 |
3 | 100120201020101120100011 |
4 | 1131112031003312311 |
5 | 3120233002341203 |
6 | 114013435420221 |
7 | 10145543203210 |
oct | 1352615036665 |
9 | 316636346304 |
10 | 100230512053 |
11 | 39564569231 |
12 | 17512bb4671 |
13 | 95b44baac9 |
14 | 4bcb906777 |
15 | 29195be76d |
hex | 1756343db5 |
100230512053 has 4 divisors (see below), whose sum is σ = 114549156640. Its totient is φ = 85911867468.
The previous prime is 100230512047. The next prime is 100230512059. The reversal of 100230512053 is 350215032001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (100230512047) and next prime (100230512059).
It is not a de Polignac number, because 100230512053 - 29 = 100230511541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100230512059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7159322283 + ... + 7159322296.
It is an arithmetic number, because the mean of its divisors is an integer number (28637289160).
Almost surely, 2100230512053 is an apocalyptic number.
It is an amenable number.
100230512053 is a deficient number, since it is larger than the sum of its proper divisors (14318644587).
100230512053 is an equidigital number, since it uses as much as digits as its factorization.
100230512053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14318644586.
The product of its (nonzero) digits is 900, while the sum is 22.
Adding to 100230512053 its reverse (350215032001), we get a palindrome (450445544054).
The spelling of 100230512053 in words is "one hundred billion, two hundred thirty million, five hundred twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •