Base | Representation |
---|---|
bin | 11110010111000001101… |
… | …01100001101001001110 |
3 | 10200201120012200121102001 |
4 | 33023200311201221032 |
5 | 114042334434312304 |
6 | 2115115103022514 |
7 | 135236222341303 |
oct | 17134065415116 |
9 | 3621505617361 |
10 | 1043154213454 |
11 | 3724433a4211 |
12 | 14a20629aa3a |
13 | 774a49782a2 |
14 | 386bb8c10aa |
15 | 1c205104da4 |
hex | f2e0d61a4e |
1043154213454 has 8 divisors (see below), whose sum is σ = 1602895498848. Its totient is φ = 508855713840.
The previous prime is 1043154213383. The next prime is 1043154213457. The reversal of 1043154213454 is 4543124513401.
It is a happy number.
1043154213454 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 super-2 number, since 2×10431542134542 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1043154213457) 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, 6360696342 + ... + 6360696505.
It is an arithmetic number, because the mean of its divisors is an integer number (200361937356).
Almost surely, 21043154213454 is an apocalyptic number.
1043154213454 is a deficient number, since it is larger than the sum of its proper divisors (559741285394).
1043154213454 is a wasteful number, since it uses less digits than its factorization.
1043154213454 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12721392890.
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 1043154213454 its reverse (4543124513401), we get a palindrome (5586278726855).
The spelling of 1043154213454 in words is "one trillion, forty-three billion, one hundred fifty-four million, two hundred thirteen thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •