Base | Representation |
---|---|
bin | 1010011101101011011101… |
… | …11101000101001000011101 |
3 | 10000110201211112221222112112 |
4 | 11032311232331011020131 |
5 | 11003443440313411422 |
6 | 120534352040243405 |
7 | 4563263166015614 |
oct | 516655675051035 |
9 | 100421745858475 |
10 | 23010001310237 |
11 | 7371539963167 |
12 | 26b75aaa70565 |
13 | cabaabb6c596 |
14 | 59799353887b |
15 | 29d822645ee2 |
hex | 14ed6ef4521d |
23010001310237 has 2 divisors, whose sum is σ = 23010001310238. Its totient is φ = 23010001310236.
The previous prime is 23010001310207. The next prime is 23010001310239. The reversal of 23010001310237 is 73201310001032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21084314998756 + 1925686311481 = 4591766^2 + 1387691^2 .
It is a cyclic number.
It is not a de Polignac number, because 23010001310237 - 222 = 23009997115933 is a prime.
Together with 23010001310239, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23010001310239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11505000655118 + 11505000655119.
It is an arithmetic number, because the mean of its divisors is an integer number (11505000655119).
Almost surely, 223010001310237 is an apocalyptic number.
It is an amenable number.
23010001310237 is a deficient number, since it is larger than the sum of its proper divisors (1).
23010001310237 is an equidigital number, since it uses as much as digits as its factorization.
23010001310237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 23010001310237 its reverse (73201310001032), we get a palindrome (96211311311269).
The spelling of 23010001310237 in words is "twenty-three trillion, ten billion, one million, three hundred ten thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •