Base | Representation |
---|---|
bin | 1110010011010101001010… |
… | …00110100100001111010101 |
3 | 11010100122021211221000211002 |
4 | 13021222211012210033111 |
5 | 13110241131222101003 |
6 | 150520100351353045 |
7 | 6424140134262215 |
oct | 711524506441725 |
9 | 133318254830732 |
10 | 31450520503253 |
11 | a0260aaa02175 |
12 | 363b3a3822785 |
13 | 1471a04899417 |
14 | 7aa2db498245 |
15 | 398178346a88 |
hex | 1c9aa51a43d5 |
31450520503253 has 4 divisors (see below), whose sum is σ = 32217606369228. Its totient is φ = 30683434637280.
The previous prime is 31450520503147. The next prime is 31450520503301. The reversal of 31450520503253 is 35230502505413.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3980531746129 + 27469988757124 = 1995127^2 + 5241182^2 .
It is a cyclic number.
It is not a de Polignac number, because 31450520503253 - 212 = 31450520499157 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 (31450520503453) 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, 383542932926 + ... + 383542933007.
It is an arithmetic number, because the mean of its divisors is an integer number (8054401592307).
Almost surely, 231450520503253 is an apocalyptic number.
It is an amenable number.
31450520503253 is a deficient number, since it is larger than the sum of its proper divisors (767085865975).
31450520503253 is an equidigital number, since it uses as much as digits as its factorization.
31450520503253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 767085865974.
The product of its (nonzero) digits is 270000, while the sum is 38.
The spelling of 31450520503253 in words is "thirty-one trillion, four hundred fifty billion, five hundred twenty million, five hundred three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •