Base | Representation |
---|---|
bin | 100001100110001010100… |
… | …111010111110110100001 |
3 | 22011201012212122221211112 |
4 | 201212022213113312201 |
5 | 300311231042440243 |
6 | 4524340202353105 |
7 | 325541210556266 |
oct | 41461247276641 |
9 | 8151185587745 |
10 | 2308723015073 |
11 | 81013aa54452 |
12 | 3135427bb795 |
13 | 139933643057 |
14 | 7da5830526d |
15 | 400c63a3818 |
hex | 2198a9d7da1 |
2308723015073 has 8 divisors (see below), whose sum is σ = 2309785551360. Its totient is φ = 2307660732000.
The previous prime is 2308723015069. The next prime is 2308723015127. The reversal of 2308723015073 is 3705103278032.
2308723015073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2308723015073 - 22 = 2308723015069 is a prime.
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 2308723015073.
It is not an unprimeable number, because it can be changed into a prime (2308723015003) 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, 19547948 + ... + 19665698.
It is an arithmetic number, because the mean of its divisors is an integer number (288723193920).
Almost surely, 22308723015073 is an apocalyptic number.
It is an amenable number.
2308723015073 is a deficient number, since it is larger than the sum of its proper divisors (1062536287).
2308723015073 is a wasteful number, since it uses less digits than its factorization.
2308723015073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126607.
The product of its (nonzero) digits is 211680, while the sum is 41.
The spelling of 2308723015073 in words is "two trillion, three hundred eight billion, seven hundred twenty-three million, fifteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •