Base | Representation |
---|---|
bin | 1110000110110011011110… |
… | …11011001110110000011111 |
3 | 11001211111100201111201200111 |
4 | 13003121233123032300133 |
5 | 13031213203021033043 |
6 | 145550240424110451 |
7 | 6351062366610136 |
oct | 703315733166037 |
9 | 131744321451614 |
10 | 31020123221023 |
11 | 997a618957822 |
12 | 358baa8605427 |
13 | 1440253796761 |
14 | 79354c1d291d |
15 | 38bd87eeb09d |
hex | 1c366f6cec1f |
31020123221023 has 4 divisors (see below), whose sum is σ = 31023073875808. Its totient is φ = 31017172566240.
The previous prime is 31020123220987. The next prime is 31020123221077. The reversal of 31020123221023 is 32012232102013.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31020123221023 - 217 = 31020123089951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31020123220985 and 31020123221003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31020123231023) 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, 1475311623 + ... + 1475332648.
It is an arithmetic number, because the mean of its divisors is an integer number (7755768468952).
Almost surely, 231020123221023 is an apocalyptic number.
31020123221023 is a deficient number, since it is larger than the sum of its proper divisors (2950654785).
31020123221023 is a wasteful number, since it uses less digits than its factorization.
31020123221023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2950654784.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 31020123221023 its reverse (32012232102013), we get a palindrome (63032355323036).
The spelling of 31020123221023 in words is "thirty-one trillion, twenty billion, one hundred twenty-three million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •