Base | Representation |
---|---|
bin | 1001001100100011100010… |
… | …0001001001111011110011 |
3 | 1022210122000222010120122010 |
4 | 2103020320201021323303 |
5 | 2311130421103332243 |
6 | 33301022340414003 |
7 | 2062342320241206 |
oct | 223107041117363 |
9 | 38718028116563 |
10 | 10111301230323 |
11 | 32491a6a41797 |
12 | 117377a3a7303 |
13 | 5846511013a7 |
14 | 26d56507393d |
15 | 1280413c0433 |
hex | 93238849ef3 |
10111301230323 has 8 divisors (see below), whose sum is σ = 13481812021968. Its totient is φ = 6740828962784.
The previous prime is 10111301230313. The next prime is 10111301230369. The reversal of 10111301230323 is 32303210311101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10111301230323 - 24 = 10111301230307 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10111301230323.
It is not an unprimeable number, because it can be changed into a prime (10111301230313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9012936 + ... + 10072517.
It is an arithmetic number, because the mean of its divisors is an integer number (1685226502746).
Almost surely, 210111301230323 is an apocalyptic number.
10111301230323 is a deficient number, since it is larger than the sum of its proper divisors (3370510791645).
10111301230323 is a wasteful number, since it uses less digits than its factorization.
10111301230323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19262053.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10111301230323 its reverse (32303210311101), we get a palindrome (42414511541424).
The spelling of 10111301230323 in words is "ten trillion, one hundred eleven billion, three hundred one million, two hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •