Base | Representation |
---|---|
bin | 1000000001110010… |
… | …1011010111101011 |
3 | 12120012000102001211 |
4 | 2000130223113223 |
5 | 13403140020243 |
6 | 553501053551 |
7 | 104255131456 |
oct | 20034532753 |
9 | 5505012054 |
10 | 2155001323 |
11 | a06495432 |
12 | 5018572b7 |
13 | 284607817 |
14 | 1662c649d |
15 | c92cdd9d |
hex | 8072b5eb |
2155001323 has 8 divisors (see below), whose sum is σ = 2218104992. Its totient is φ = 2092153536.
The previous prime is 2155001297. The next prime is 2155001327. The reversal of 2155001323 is 3231005512.
2155001323 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 2155001323 - 213 = 2154993131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2155001294 and 2155001303.
It is not an unprimeable number, because it can be changed into a prime (2155001327) 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, 46815 + ... + 80632.
It is an arithmetic number, because the mean of its divisors is an integer number (277263124).
Almost surely, 22155001323 is an apocalyptic number.
2155001323 is a deficient number, since it is larger than the sum of its proper divisors (63103669).
2155001323 is a wasteful number, since it uses less digits than its factorization.
2155001323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127941.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 2155001323 is about 46421.9918034545. The cubic root of 2155001323 is about 1291.6628842697.
Adding to 2155001323 its reverse (3231005512), we get a palindrome (5386006835).
The spelling of 2155001323 in words is "two billion, one hundred fifty-five million, one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •