Base | Representation |
---|---|
bin | 11101101011111010110… |
… | …110001010110000001011 |
3 | 21020000122201012000110001 |
4 | 131223322312022300023 |
5 | 231410431342031443 |
6 | 4201101300503431 |
7 | 300246446260321 |
oct | 35537266126013 |
9 | 7200581160401 |
10 | 2040023002123 |
11 | 71719488a747 |
12 | 28b4536aab77 |
13 | 11a4b130b652 |
14 | 70a48127d11 |
15 | 380eba09d4d |
hex | 1dafad8ac0b |
2040023002123 has 4 divisors (see below), whose sum is σ = 2041452592200. Its totient is φ = 2038593412048.
The previous prime is 2040023002099. The next prime is 2040023002151. The reversal of 2040023002123 is 3212003200402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2040023002123 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 2040023002123.
It is not an unprimeable number, because it can be changed into a prime (2040023032123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 714792898 + ... + 714795751.
It is an arithmetic number, because the mean of its divisors is an integer number (510363148050).
Almost surely, 22040023002123 is an apocalyptic number.
2040023002123 is a deficient number, since it is larger than the sum of its proper divisors (1429590077).
2040023002123 is a wasteful number, since it uses less digits than its factorization.
2040023002123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429590076.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 2040023002123 its reverse (3212003200402), we get a palindrome (5252026202525).
The spelling of 2040023002123 in words is "two trillion, forty billion, twenty-three million, two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •