Base | Representation |
---|---|
bin | 10000101111000011011… |
… | …100111010100110110001 |
3 | 11001221102221111201012112 |
4 | 100233003130322212301 |
5 | 122320233030431413 |
6 | 2240152521535105 |
7 | 146041643440361 |
oct | 20570334724661 |
9 | 4057387451175 |
10 | 1150035405233 |
11 | 403800006570 |
12 | 166a74644495 |
13 | 845a8c93330 |
14 | 3d93a7b29a1 |
15 | 1edad4db2a8 |
hex | 10bc373a9b1 |
1150035405233 has 8 divisors (see below), whose sum is σ = 1351090546176. Its totient is φ = 965064675600.
The previous prime is 1150035405227. The next prime is 1150035405283. The reversal of 1150035405233 is 3325045300511.
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 1150035405233 - 24 = 1150035405217 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 1150035405233.
It is not an unprimeable number, because it can be changed into a prime (1150035405203) 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, 4021102673 + ... + 4021102958.
It is an arithmetic number, because the mean of its divisors is an integer number (168886318272).
Almost surely, 21150035405233 is an apocalyptic number.
1150035405233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1150035405233 is a deficient number, since it is larger than the sum of its proper divisors (201055140943).
1150035405233 is a wasteful number, since it uses less digits than its factorization.
1150035405233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8042205655.
The product of its (nonzero) digits is 27000, while the sum is 32.
The spelling of 1150035405233 in words is "one trillion, one hundred fifty billion, thirty-five million, four hundred five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •