Base | Representation |
---|---|
bin | 101111100000110001… |
… | …0100100100101000111 |
3 | 100202100201220202010210 |
4 | 1133001202210211013 |
5 | 3132430004010343 |
6 | 114512245050503 |
7 | 10241300565330 |
oct | 1370142444507 |
9 | 322321822123 |
10 | 102031313223 |
11 | 3a2a901a864 |
12 | 179360b6a33 |
13 | 98105cb728 |
14 | 4d1cb4b287 |
15 | 29c2735333 |
hex | 17c18a4947 |
102031313223 has 32 divisors (see below), whose sum is σ = 163958794240. Its totient is φ = 55133900640.
The previous prime is 102031313203. The next prime is 102031313231. The reversal of 102031313223 is 322313130201.
It is not a de Polignac number, because 102031313223 - 218 = 102031051079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102031313223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102031313203) 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 31 ways as a sum of consecutive naturals, for example, 15493 + ... + 451998.
It is an arithmetic number, because the mean of its divisors is an integer number (5123712320).
Almost surely, 2102031313223 is an apocalyptic number.
102031313223 is a deficient number, since it is larger than the sum of its proper divisors (61927481017).
102031313223 is a wasteful number, since it uses less digits than its factorization.
102031313223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468067.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102031313223 its reverse (322313130201), we get a palindrome (424344443424).
The spelling of 102031313223 in words is "one hundred two billion, thirty-one million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •